Extending Finite Memory Determinacy to Multiplayer Games
نویسندگان
چکیده
منابع مشابه
Extending Finite Memory Determinacy to Multiplayer Games
We provide several techniques to extend finite memory determinacy from some restricted class of games played on a finite graph to a larger class. As a particular example, we study energy parity games. First we show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built fro...
متن کاملMemoryless determinacy of finite parity games: Another simple proof
Memoryless determinacy of (infinite) parity games is an important result with numerous applications. It was first independently established by Emerson and Jutla [1] and Mostowski [2] but their proofs involve elaborate developments. The elegant and simpler proof of Zielonka [3] still requires a nested induction on the finite number of priorities and on ordinals for sets of vertices. There are ot...
متن کاملBorel Determinacy of Concurrent Games
Just as traditional games can be represented by trees, so concurrent games can be represented by event structures. We show the determinacy of such concurrent games with Borel sets of configurations as winning conditions, provided they are race-free and bounded-concurrent. Both properties are shown necessary. The determinacy proof proceeds via a reduction to the determinacy of tree games, and th...
متن کاملTowards multiplayer BCI games
Traditional brain-computer interface (BCI) research has forked to consider not only disabled patients but able-bodied users as well. Among various biosignals, electroencephalogram (EEG) is a cheap, portable and popular means of accessing brain activity. As a result, EEG-based BCIs are gradually being used in everyday applications, including games. Just as any computer product, human-computer in...
متن کاملDeterminacy of Adversarial Gowers Games
We prove a game theoretic dichotomy for Gδσ sets of block sequences in vector spaces that extends, on the one hand, the block Ramsey theorem of W. T. Gowers proved for analytic sets of block sequences and, on the other hand, M. Davis’ proof of Σ3 determinacy.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2016
ISSN: 2075-2180
DOI: 10.4204/eptcs.218.3